Compact representations as a search strategy: Compression EDAs
نویسندگان
چکیده
منابع مشابه
Compact representations as a search strategy: Compression EDAs
The choice of representation crucially determines the capability of search processes to find complex solutions in which many variables interact. The question is how good representations can be found and how they can be adapted online to account for what can be learned about the structure of the problem from previous samples. We address these questions in a scenario that we term indirect Estimat...
متن کاملCompact Genetic Codes as a Search Strategy of Evolutionary Processes
The choice of genetic representation crucially determines the capability of evolutionary processes to find complex solutions in which many variables interact. The question is how good genetic representations can be found and how they can be adapted online to account for what can be learned about the structure of the problem from previous samples. We address these questions in a scenario that we...
متن کاملCompact Representations of Search in Complex Domains
We consider the problem of searching in complex domains for a buggy element. The structure of the domain determines the set of possible queries at every stage of the search. An important type of search domain is a Directed Acyclic Graph (DAG), where one can query every sub-graph. In this work we focus on reducing the number of sets required to represent a search domain. Our results include: Exa...
متن کاملCompact elliptic curve representations
Let y D x C ax C b be an elliptic curve over Fp , p being a prime number greater than 3, and consider a; b 2 Œ1; p. In this paper, we study elliptic curve isomorphisms, with a view towards reduction in the size of elliptic curves coefficients. We first consider reducing the ratio a=b. We then apply these considerations to determine the number of elliptic curve isomorphism classes. Later we wor...
متن کاملCompact Representations of Cuts
Consider the ( n 2 ) (or O(n2)) min-cut problems on a graph with n nodes and nonnegative edge weights. Gomory and Hu [J. Soc. Indust. Appl. Math., 9 (1961), pp. 551–570] showed (essentially) that there are at most n−1 different min-cuts. They also described a compact structure (the flow equivalent tree) of size O(n) with the following property: for any pair of nodes, the value of a min-cut can ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.04.005